class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left=0,right=nums.size()-1;
        while(left<=right){
            int mid=left+((right-left)>>2);
            if(nums[mid]<=target){
                left=mid+1;
            }else{
                right=mid-1;
            }
        }
        if(right>0&&nums[right]!=target)return 0;
        int end=right;
        left=0;
        right=nums.size()-1;
        while(left<=right){
            int mid=left+((right-left)>>2);
            if(nums[mid]<target){
                left=mid+1;
            }else{
                right=mid-1;
            }
        }
        int begin=right;
        return end-begin;
    }
};